Efficient Uzawa Algorithms for Two Phase Stefan Type Problems
نویسندگان
چکیده
In this paper we present and analyze Uzawa type algorithms for solving discretized variational inequalities arising from two phase Stefan type problems. For a Uzawa type algorithm and its improved version we show convergence and derive bounds on convergence rates. For the improved Uzawa algorithm, the convergence rate is shown to be uniformly bounded away from 1 if τh−2 is kept bounded, with τ the time stepsize and h the space meshsize.
منابع مشابه
Nonlinear Two-Phase Stefan Problem
In this paper we consider a nonlinear two-phase Stefan problem in one-dimensional space. The problem is mapped into a nonlinear Volterra integral equation for the free boundary.
متن کاملNewton-Product integration for a Two-phase Stefan problem with Kinetics
We reduce the two phase Stefan problem with kinetic to a system of nonlinear Volterra integral equations of second kind and apply Newton's method to linearize it. We found product integration solution of the linear form. Sufficient conditions for convergence of the numerical method are given and their applicability is illustrated with an example.
متن کاملNumerical Discrete Algorithm for Some Nonlinear Problems
In this paper we use the eigenfunctions of the Laplacian to approximate the solution of some nonlinear equations which are used to model natural phenomena (as the Navier-Stokes flow equations, for instance). In this respect we propose a numerical algorithm, combining the Uzawa and Arrow-Hurwitz algorithms. The algorithm proposed here shares features from both algorithms, and it has the followin...
متن کاملAn Inexact Uzawa-Type Iterative Method for Solving Saddle Point Problems
As an extension of the inexact Uzawa algorithm addressed in 1], we propose an improved inexact Uzawa-type iterative method for solving saddle point problems. The convergence rate is given in terms of the rates of the two basic iterations as deened in 1], and it is shown that the new algorithm always converges as long as the two basic iterations converge. A running title: Uzawa algorithm for sad...
متن کاملTwo new variants of nonlinear inexact Uzawa algorithms for saddle-point problems
In this paper, we consider some nonlinear inexact Uzawa methods for iteratively solving linear saddle-point problems. By means of a new technique, we first give an essential improvement on the convergence results of Bramble-Paschiak-Vassilev for a known nonlinear inexact Uzawa algorithm. Then we propose two new algorithms, which can be viewed as a combination of the known nonlinear inexact Uzaw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007